T=int(input())
for i in range(T):
n,x=map(int,input().split(' '))
a=list(map(int,input().split(' ')))
a.sort()
cnt=0
o=0
for u in a[::-1]:
cnt+=1
if cnt*u>=x:
o+=1
cnt=0
print(o)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll t;
cin>>t;
while(t--){
ll n, x;
cin>>n>>x;
ll a[n];
for(ll i = 0; i < n; i++)
{
cin>>a[i];
}
sort(a, a+n);
ll num = 0, cnt = 0;
for(long i = n-1; i >= 0; i--)
{
++cnt;
if(cnt * a[i] >= x){
++num;
cnt = 0;
}
}
cout<<num<<endl; }
}
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |